#include <iostream>
using namespace std;
const int N = 10005;

struct Edge{
	int a,b,c;
} e[N];

int n, m, k;
int idx, dist[N];

void bellman_ford(){
	for (int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			dist[e[j].b] = min(dist[e[j].b], dist[e[j].a] + e[j].c);
		}
	}
}

int main(){
	cin >> n >> m >> k;
	int a,b,c;
	while (m--!=0) {
		cin >> a >> b >> c;
		e[idx++] = {a,b,c};
	}
	return 0;
}


